Optimal bounds for the colored Tverberg problem
نویسندگان
چکیده
منابع مشابه
Optimal bounds for the colored Tverberg problem
We prove a “Tverberg type” multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Bárány et al. (1980), by adding color constraints. It also provides an improved bound for the (topological) colored Tverberg problem of Bárány & Larman (1992) that is tight in the prime case and asymptotically optimal ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA tight colored Tverberg theorem for maps to manifolds
We prove that any continuous map of an N -dimensional simplex ∆N with colored vertices to a d-dimensional manifold M must map r points from disjoint rainbow faces of ∆N to the same point in M : For this we have to assume that N ≥ (r − 1)(d + 1), no r vertices of ∆N get the same color, and our proof needs that r is a prime. A face of ∆N is a rainbow face if all vertices have different colors. Th...
متن کاملOptimal Bounds for the Change-Making Problem
The change making problem is the problem of representing a given value with the fewest coins possible We investigate the prob lem of determining whether the greedy algorithm produces an opti mal representation of all amounts for a given set of coin denominations c c cm Chang and Gill show that if the greedy algorithm is not always optimal then there exists a counterexample x in the range c x cm...
متن کاملA Geometric Proof of the Colored Tverberg Theorem
The colored Tverberg theorem asserts that for every d and r there exists t = t(d, r) such that for every set C ⊂ R of cardinality (d + 1)t, partitioned into t-point subsets C1, C2, . . . , Cd+1 (which we think of as color classes; e.g., the points of C1 are red, the points of C2 blue, etc.), there exist r disjoint sets R1, R2, . . . , Rr ⊆ C that are rainbow, meaning that |Ri ∩ Cj| ≤ 1 for ever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the European Mathematical Society
سال: 2015
ISSN: 1435-9855
DOI: 10.4171/jems/516